翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

partial order reduction : ウィキペディア英語版
partial order reduction
In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking algorithm. It exploits the commutativity of concurrently executed transitions, which result in the same state when executed in different orders.
In explicit state space exploration, partial order reduction usually refers to the specific technique of expanding a representative subset of
all enabled transitions. This technique has also been described as model checking with representatives .
There are various versions of the method, the so-called stubborn set method , ample set method , and
persistent set method .
== Ample sets ==
Ample sets are an example of model checking with representatives. Their formulation relies on a separate notion of ''dependency''. Two transitions are considered independent only if whenever they are mutually enabled, they cannot disable another
and the execution of both results in a unique state regardless of the order in which they are executed.
Transitions that are not independent, are dependent.
In practice dependency is approximated using static analysis.
Ample sets for different purposes can be defined by giving conditions as to when a set
of transitions is "ample" in a given state.
C0 \iff
C1 If a transition \alpha depends on some transition relation in ample(s), this transition cannot be invoked until some transition in the ample set is executed.
Conditions C0 and C1 are sufficient for preserving all the deadlocks in the state space.
Further restrictions are needed in order to preserve more nuanced properties. For instance,
in order to preserve properties of linear temporal logic, the following two conditions are needed:
C2 If enabled(s) \neq ample(s) , each transition in the ample set is invisible
C3 A cycle is not allowed if it contains a state in which some transition \alpha is enabled, but is never included in ample(s) for any states s on the cycle.
These conditions are sufficient for an ample set, but not necessary conditions .

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「partial order reduction」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.